Infinite generalized friendship graphs
نویسندگان
چکیده
منابع مشابه
Infinite friendship graphs with infinite parameters
We study infinite graphs in which every set of κ vertices has exactly λ common neighbours. We prove that there exist 2σ such graphs of each infinite order σ if κ is finite and that for κ infinite there are 2λ of them of order λ and none of cardinality greater than λ (assuming the GCH). Further, we show that all a priori admissible chromatic numbers are in fact possible for such graphs.
متن کاملFriendship Two-Graphs
A friendship graph is a graph in which every two distinct vertices have exactly one common neighbor. All finite friendship graphs are known, each of them consists of triangles having a common vertex. We extend friendship graphs to two-graphs, a two-graph being an ordered pair G = (G0, G1) of edge-disjoint graphs G0 and G1 on the same vertex-set V (G0) = V (G1). One may think that the edges of G...
متن کاملFriendship decompositions of graphs
We investigate the maximum number of elements in an optimal t-friendship decomposition of graphs of order n. Asymptotic results will be obtained for all fixed t ≥ 4 and for t = 2, 3 exact results will be derived.
متن کاملThe Friendship Problem on Graphs
In this paper we provide a purely combinatorial proof of the Friendship Theorem, which has been first proven by P. Erdös et al. by using also algebraic methods. Moreover, we generalize this theorem in a natural way, assuming that every pair of nodes occupies ≥ 2 common neighbors. We prove that every graph, which satisfies this generalized -friendship condition, is a regular graph.
متن کاملOn Generalized Coprime Graphs
Paul Erdos defined the concept of coprime graph and studied about cycles in coprime graphs. In this paper this concept is generalized and a new graph called Generalized coprime graph is introduced. Having observed certain basic properties of the new graph it is proved that the chromatic number and the clique number of some generalized coprime graphs are equal.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 1984
ISSN: 0012-365X
DOI: 10.1016/0012-365x(84)90162-6